Five Ways of Reducing the Crank-Nicolson Oscillations
نویسندگان
چکیده
منابع مشابه
Five Ways of Reducing the Crank-Nicolson Oscillations
Crank-Nicolson is a popular method for solving parabolic equations because it is unconditionally stable and second order accurate. One drawback of CN is that it responds to jump discontinuities in the initial conditions with oscillations which are weakly damped and therefore may persist for a long time. We present a selection of methods to reduce the amplitude of these oscillations.
متن کاملDamping of Crank-Nicolson error oscillations
The Crank-Nicolson (CN) simulation method has an oscillatory response to sharp initial transients. The technique is convenient but the oscillations make it less popular. Several ways of damping the oscillations in two types of electrochemical computations are investigated. For a simple one-dimensional system with an initial singularity, subdivision of the first time interval into a number of eq...
متن کاملAdaptive Crank-nicolson Methods for Parabolic Problems
In this paper we present a posteriori error estimators for the approximate solutions of linear parabolic equations. We consider discretizations of the problem by discontinuous Galerkin method in time corresponding to variant Crank-Nicolson schemes and continuous Galerkin method in space. Especially, £nite element spaces are permitted to change at different time levels. Exploiting Crank-Nicolson...
متن کاملInstability of Crank-Nicolson Leap-Frog for Nonautonomous Systems
stability in the autonomous, scalar case was proven in 1963 in Johansson and Kreiss (9), see also (4), and for non-commuting, autonomous systems in 2012 (12), see also (17) for background. We prove herein weak instability in the nonautonomous case. The extension of stability for ODEs from autonomous to nonautonomous (with test problem y′ = λ (t)y) has a rich history. Dahlquist (3) proved that a...
متن کاملConvergence analysis of Crank–Nicolson and Rannacher time-marching
This paper presents a convergence analysis of Crank–Nicolson and Rannacher time-marching methods which are often used in finite difference discretizations of the Black–Scholes equations. Particular attention is paid to the important role of Rannacher’s startup procedure, in which one or more initial timesteps use backward Euler timestepping, to achieve second-order convergence for approximation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 2002
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v31i558.7115